See constant time on Wiktionary
Download JSON data for constant time meaning in All languages combined (1.5kB)
{
"forms": [
{
"form": "constant times",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "constant time (countable and uncountable, plural constant times)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Computer science",
"orig": "en:Computer science",
"parents": [
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"examples": [
{
"text": "Coordinate term: amortized constant time"
}
],
"glosses": [
"An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input."
],
"id": "en-constant_time-en-noun-~y~s5MYz",
"links": [
[
"computer science",
"computer science"
],
[
"algorithm",
"algorithm"
],
[
"value",
"value"
],
[
"bounded",
"bounded"
],
[
"depend",
"depend"
],
[
"size",
"size"
],
[
"input",
"input"
]
],
"raw_glosses": [
"(computer science) An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "constant time"
}
{
"forms": [
{
"form": "constant times",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "~"
},
"expansion": "constant time (countable and uncountable, plural constant times)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English uncountable nouns",
"en:Computer science"
],
"examples": [
{
"text": "Coordinate term: amortized constant time"
}
],
"glosses": [
"An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input."
],
"links": [
[
"computer science",
"computer science"
],
[
"algorithm",
"algorithm"
],
[
"value",
"value"
],
[
"bounded",
"bounded"
],
[
"depend",
"depend"
],
[
"size",
"size"
],
[
"input",
"input"
]
],
"raw_glosses": [
"(computer science) An algorithm, also written as O(1) time) where the value of T(n) (the complexity of the algorithm) is bounded by a value that does not depend on the size of the input."
],
"tags": [
"countable",
"uncountable"
],
"topics": [
"computer",
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "constant time"
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-20 from the enwiktionary dump dated 2024-05-02 using wiktextract (1d5a7d1 and 304864d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.